Map evaluation using matched topology graphs
نویسندگان
چکیده
Mapping is an important task for mobile robots. The assessment of the quality of maps in a simple, efficient and automated way is not trivial and an ongoing research topic. Here, a new approach for the evaluation of 2D grid maps is presented. This structurebased method makes use of a Topology Graph, i.e., a topological representation that includes abstracted local metric information. It is shown how the Topology Graph is constructed from a Voronoi Diagram that is pruned and simplified such that only high level topological information remains to concentrate on larger, topologically distinctive places. Several methods for computing the similarity of vertices in two Topology Graphs, i.e., for performing a place-recognition, are presented. Based on the similarities, it is shown how subgraphisomorphisms can be efficiently computed and two Topology Graphs can be matched. The match between the graphs is then used to calculate a number of standard map evaluation attributes like coverage, global accuracy, relative accuracy, consistency, and brokenness. Experiments with robot generated maps are used to highlight the capabilities of the proposed approach and to evaluate the performance of the underlying algorithms.
منابع مشابه
An Alexandroff topology on graphs
Let G = (V,E) be a locally finite graph, i.e. a graph in which every vertex has finitely many adjacent vertices. In this paper, we associate a topology to G, called graphic topology of G and we show that it is an Alexandroff topology, i.e. a topology in which intersec- tion of every family of open sets is open. Then we investigate some properties of this topology. Our motivation is to give an e...
متن کاملPOINTWISE CONVERGENCE TOPOLOGY AND FUNCTION SPACES IN FUZZY ANALYSIS
We study the space of all continuous fuzzy-valued functions from a space $X$ into the space of fuzzy numbers $(mathbb{E}sp{1},dsb{infty})$ endowed with the pointwise convergence topology. Our results generalize the classical ones for continuous real-valued functions. The field of applications of this approach seems to be large, since the classical case allows many known devices to be fi...
متن کاملPolicy-Preferred Paths in AS-level Internet Topology Graphs
Using Autonomous System (AS) level Internet topology maps to determine accurate AS-level paths is essential for network diagnostics, performance optimization, security enforcement, business policy management and topology-aware application development. One significant drawback that we have observed in many studies is simplifying the AS-level topology map of the Internet to an undirected graph, a...
متن کاملCapturing Topology in Graph Pattern Matching
Graph pattern matching is often defined in terms of subgraph isomorphism, an np-complete problem. To lower its complexity, various extensions of graph simulation have been considered instead. These extensions allow pattern matching to be conducted in cubic-time. However, they fall short of capturing the topology of data graphs, i.e., graphs may have a structure drastically different from patter...
متن کاملAnalyzing and modelling the AS-level Internet topology
Recently we introduced the rich-club phenomenon as a quantitative metric to characterize the tier structure of the Autonomous Systems level Internet topology (AS graph) and we proposed the Interactive Growth (IG) model, which closely matches the degree distribution and hierarchical structure of the AS graph and compares favourble with other available Internet power-law topology generators. Our ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Auton. Robots
دوره 40 شماره
صفحات -
تاریخ انتشار 2016